Subsumption Algorithms for Three-Valued Geometric Resolution
نویسنده
چکیده
In our implementation of geometric resolution, the most costly operation is subsumption testing (or matching): One has to decide for a three-valued, geometric formula, if this formula is false in a given interpretation. The formula contains only atoms with variables, equality, and existential quantifiers. The interpretation contains only atoms with constants. Because the atoms have no term structure, matching for geometric resolution is hard. We translate the matching problem into a generalized constraint satisfaction problem, and discuss several approaches for solving it, two direct algorithms and two translations to propositional SAT. After that, we study filtering techniques based on local consistency checking. Such filtering techniques can a priori refute a large percentage of generalized constraint satisfaction problems. Finally, we adapt the matching algorithms in such a way that they find solutions that use a minimal subset of the interpretation. The adaptation can be combined with every matching algorithm. The techniques presented in this paper may have applications in constraint solving.
منابع مشابه
A Sequent Calculus for Reasoning in Four-Valued Description Logics
Description Logics (DLs, for short) provide a logical reconstruction of the so-called frame-based knowledge representation languages. Originally, four-valued DLs have been proposed in order to develop expressively powerful DLs with tractable subsumption algorithms. Recently, four-valued DLs have been proposed as a model for (multimedia) document retrieval. In this context, the main reasoning ta...
متن کاملUsing Three-Valued Logic to Specify and Verify Algorithms of Computational Geometry
Many safety-critical systems deal with geometric objects. Reasoning about the correctness of such systems is mandatory and requires the use of basic definitions of geometry for the specification of these systems. Despite the intuitive meaning of such definitions, their formalisation is not at all straightforward: In particular, degeneracies lead to situations where none of the Boolean truth val...
متن کاملInteger Valued AR(1) with Geometric Innovations
The classical integer valued first-order autoregressive (INA- R(1)) model has been defined on the basis of Poisson innovations. This model has Poisson marginal distribution and is suitable for modeling equidispersed count data. In this paper, we introduce an modification of the INAR(1) model with geometric innovations (INARG(1)) for model- ing overdispersed count data. We discuss some structu...
متن کاملForest Stand Types Classification Using Tree-Based Algorithms and SPOT-HRG Data
Forest types mapping, is one of the most necessary elements in the forest management and silviculture treatments. Traditional methods such as field surveys are almost time-consuming and cost-intensive. Improvements in remote sensing data sources and classification –estimation methods are preparing new opportunities for obtaining more accurate forest biophysical attributes maps. This research co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016